Refinements of Levenshtein bounds in q-ary Hamming spaces
نویسندگان
چکیده
We develop refinements of the Levenshtein bound in q-ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by Levenshtein. The first relevant cases are investigated in detail and new bounds are presented. In particular, we derive generalizations and q-ary analogs of a MacEliece bound. We provide evidence that our approach is as good as the complete linear programming and discuss how faster are our calculations. Finally, we present a table with parameters of codes which, if exist, would attain our bounds.
منابع مشابه
Energy bounds for codes and designs in Hamming spaces
We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes.
متن کاملEstimates of the distance distribution of nonbinary codes, with applications
We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space. Applications of the bounds include a better asymptotic upper bound on the weight distribution of Goppa codes from maximal curves, a new upper bound on the size of a q-ary code with a given rth generalized weight, improved estimates of the size of secant spaces of a...
متن کاملIdentifying Codes in q-ary Hypercubes
Let q be any integer ≥ 2. In this paper, we consider the q-ary ndimensional cube whose vertex set is Znq and two vertices (x1, . . . , xn) and (y1, . . . , yn) are adjacent if their Lee distance is 1. As a natural extension of identifying codes in binary Hamming spaces, we further study identifying codes in the above q-ary hypercube. We let M t (n) denote the smallest cardinality of t-identifyi...
متن کاملA class of q-ary linear codes derived from irreducible cyclic codes
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of q-ary linear codes derived from irreducible cyclic codes with q a prime power. We use Gauss sums to represent its Hamming weights and obtain the bounds of its minimum Hamming distance. In some cases, we explicitl...
متن کاملOne-Gapped q-Gram Filtersfor Levenshtein Distance
We have recently shown that q-gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming distance. In this paper, we extend the results for the Levenshtein distance, which is more problematic for gapped q-grams because an insertion or deletion in a gap affects a q-gram while a replacement do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.01982 شماره
صفحات -
تاریخ انتشار 2018